On Semantics and Correctness of Reactive Rule-Based Programs

نویسندگان

  • Man Lin
  • Jacek Malec
  • Simin Nadjm-Tehrani
چکیده

The rule-based paradigm for knowledge representation appears in many disguises within computer science. In this paper we address special issues which arise when the rule-based programming paradigm is employed in the development of reactive systems. We begin by presenting a rule-based language RL which has emerged while developing intelligent cruise control systems. We de ne a desired declarative semantics and correctness criteria for rule-based programs which respect causality, synchrony assumption and desired determinism. Two alternative approaches are proposed to analyze RL programs. Both approaches build upon static checks of a rule-based program. In the rst approach we accept programs which are correct with respect to a constructive semantics while in the second approach, a strati cation check is imposed. The combination of rules and reactive behaviour, together with a formal analysis of this behaviour is the main contribution of our work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving Correctness and Completeness of Normal Programs - A Declarative Approach

We advocate a declarative approach to proving properties of logic programs. Total cor-rectness can be separated into correctness, completeness and clean termination; the latter includes non-floundering. Only clean termination depends on the operational semantics, in particular on the selection rule. We show how to deal with correctness and completeness in a declarative way, treating programs on...

متن کامل

Final Semantics for Event-Pattern Reactive Programs

Event-pattern reactive programs are front-end programs for distributed reactive components that preprocess an incoming stream of event stimuli. Their purpose is to recognize temporal patterns of events that are relevant to the serviced program and ignore all other events, outsourcing some of the component’s complexity and shielding it from event overload. Correctness of event-pattern reactive p...

متن کامل

Typing with Conditions and Guarantees in LFPL

LFPL is a functional language for non-size increasing computation with an operational semantics that allows in-place update. The semantics is correct for all well-typed programs thanks to linear restrictions on the typing. Nevertheless, the linear typing is very strict and rejects many correct, natural in-place update algorithms. We investigate a general approach to easing the tight linear rest...

متن کامل

Antimonotony-based Delay Avoidance for CHR

We present an optimisation for Constraint Handling Rules (CHR) that reduces the amount of variables a constraint delays on. This optimisation reduces the overhead of delaying on variables as well as the needless reawakening of delayed constraint. A correctness proof of the optimisation based on the refined operational semantics establishes the validity of the optimisation and sheds light on pos...

متن کامل

Sound Foundations for Effective Proofs of Programs

When considering the correctness of programs, the only absolute demonstration of quality is mathematical proof. Yet the complexity of these proofs makes them all but impossible both to construct and read, and the correctness of the proofs themselves come into question. We take an approach to the creation of these proofs based on specifying an axiomatic semantics for the programming language, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999